Indexing Mixed Types for Approximate Retrieval Liang Jin Nick Koudas University of California, Irvine, USA

Source URL: flamingo.ics.uci.edu

• Finite automata
• Trie
• Software engineering
• Computer programming
• Computing
• Tree
• Distributed data storage
• String matching algorithms
• Radix tree

Genome Informatics 12: 175–Indexing Huge Genome Sequences for Solving Various Problems

Source URL: www.jsbi.org

• Computing
• String computer science)
• Computer programming
• Arrays
• LCP array
• Suffix array
• String searching algorithm
• Binary search algorithm
• Approximate string matching
• FM-index
• Trie
• Array data type

IEEE DESIGN & TEST, SPECIAL ISSUE ON “APPROXIMATE COMPUTING” 1 C IRCA -GPUs: Increasing Instruction Reuse through Inexact Computing in GP-GPUs

Source URL: mesl.ucsd.edu

• Computer architecture
• Computing
• Parallel computing
• Computer engineering
• Central processing unit
• GPGPU
• Graphics hardware
• General-purpose computing on graphics processing units
• Graphics Core Next
• Instruction set
• SIMD
• Graphics processing unit

Resistive Bloom Filters: From Approximate Membership to Approximate Computing with Bounded Errors ∗ Department † Department

Source URL: mesl.ucsd.edu

• Search algorithms
• Feature detection
• Hashing
• Error detection and correction
• Bloom filter
• Hash function
• Sobel operator
• Peak signal-to-noise ratio
• Prewitt operator
• Memristor
• Hash table

MASC: Ultra-Low Energy Multiple-Access SingleCharge TCAM for Approximate Computing Mohsen Imani, Shruti Patil, Tajana S. Rosing CSE Department, University of California San Diego, La Jolla, CA 92093, USA {moimani, patil,

Source URL: moimani.weebly.com

• Computer memory
• Associative arrays
• Emerging technologies
• Computer networking
• Content-addressable memory
• CPU cache
• General-purpose computing on graphics processing units
• Lookup table
• Sense amplifier
• Memristor

PARMA: A Parallel Randomized Algorithm for Approximate Association Rules Mining in MapReduce Matteo Riondato, Justin A. DeBrabant, Rodrigo Fonseca, and Eli Upfal Dept. of Computer Science, Brown University Providence, RI

Source URL: matteo.rionda.to

• Data mining
• Parallel computing
• Distributed computing architecture
• Association rule learning
• Data management
• MapReduce
• RANSAC
• Apache Hadoop
• Algorithm

c 2005 Cambridge University Press Combinatorics, Probability and Computing, 737–754. DOI: S0963548305007005 Printed in the United Kingdom Approximate Counting and Quantum Computation

Source URL: community.dur.ac.uk

• Quantum computing
• Computational complexity theory
• Quantum complexity theory
• Polynomials
• Complexity classes
• Tutte polynomial
• BQP
• PP
• Chromatic polynomial
• NP
• Quantum algorithm
• Time complexity

Approximate Bayesian Computing using Sequential Sampling

Source URL: astrostatistics.psu.edu

APPROXIMATE COMPUTATION OF ZERO-DIMENSIONAL POLYNOMIAL IDEALS DANIEL HELDT, MARTIN KREUZER, SEBASTIAN POKUTTA, AND HENNIE POULISSE Abstract. The Buchberger-M¨ oller algorithm is a well-known efficient tool for computing

Source URL: www.uni-passau.de

Computing approximate PSD factorizations Amitabh Basu1,? , Michael Dinitz2,?? , and Xin Li2 1 Dept. of Applied Mathematics and Statistics, Johns Hopkins University 2

Source URL: www.ams.jhu.edu